Solving Multi-Runway Departure Sequencing Problem through an Effective Genetic Algorithm
نویسندگان
چکیده
منابع مشابه
An Effective Genetic Algorithm for Solving the Multiple Traveling Salesman Problem
The multiple traveling salesman problem (MTSP) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. The objective is to minimize the total distance traveled by all the salesmen. The MTSP is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. In this paper,...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولan effective genetic algorithm for solving the multiple traveling salesman problem
the multiple traveling salesman problem (mtsp) involves scheduling m > 1 salesmen to visit a set of n > m nodes so that each node is visited exactly once. the objective is to minimize the total distance traveled by all the salesmen. the mtsp is an example of combinatorial optimization problems, and has a multiplicity of applications, mostly in the areas of routing and scheduling. in this paper,...
متن کاملHybrid Genetic-cuckoo Search Algorithm for Solving Runway Dependent Aircraft Landing Problem
As the demand for air transportation continues to grow, some flights cannot land at their preferred landing times because the airport is near its runway capacity. Therefore, devising a method for tackling the Aircraft Landing Problem (ALP) in order to optimize the usage of existing runways at airports is the focus of this study. This study, a hybrid Genetic-Cuckoo Search (GCS) algorithm for opt...
متن کاملSolving a New Multi-objective Inventory-Routing Problem by a Non-dominated Sorting Genetic Algorithm
This paper considers a multi-period, multi-product inventory-routing problem in a two-level supply chain consisting of a distributor and a set of customers. This problem is modeled with the aim of minimizing bi-objectives, namely the total system cost (including startup, distribution and maintenance costs) and risk-based transportation. Products are delivered to customers by some heterogeneous ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Energy Procedia
سال: 2011
ISSN: 1876-6102
DOI: 10.1016/j.egypro.2011.11.025